A Combinatorial Analysis of Enumerative Data Structures for Assembly Planning
نویسنده
چکیده
An assembly planner is a program designed to generate high-level plans for the manufacture of mechanical assemblies. At this time several experimental assembly planning systems have been developed. However each has deened the problem diierently, using diierent deenitions of an assembly plan and applying diierent restrictions to the planning process. This report surveys, analyzes and evaluates several key aspects of assembly planning systems. First the most common restrictions applied to assembly plans are deened and discussed. These include sequentiality, monotonicity, and coherence. Next, three distinct deenitions of what constitutes an assembly plan are described and compared. Finally, several enumerative data structures designed to represent large sets of assembly plans are described. The limitations of each structure are discussed and exact upper bounds on their size under a variety of coherence constraints are computed.
منابع مشابه
Recent Advances in Algebraic and Enumerative Combinatorics
Algebraic and enumerative combinatorics is concerned with objects that have both a combinatorial and an algebraic interpretation. It is a highly active area of the mathematical sciences, with many connections and applications to other areas, including algebraic geometry, representation theory, topology, mathematical physics and statistical mechanics. Enumerative questions arise in the mathemati...
متن کاملThe Building Game: From Enumerative Combinatorics to Conformational Diffusion
We study a discrete attachment model for the self-assembly of polyhedra called the building game.We investigate two distinct aspects of the model: (i) enumerative combinatorics of the intermediate states and (ii) a notion of Brownian motion for the polyhedral linkage defined by each intermediate that we term conformational diffusion. The combinatorial configuration space of the model is compute...
متن کاملTHE (△,□)-EDGE GRAPH G△,□ OF A GRAPH G
To a simple graph $G=(V,E)$, we correspond a simple graph $G_{triangle,square}$ whose vertex set is ${{x,y}: x,yin V}$ and two vertices ${x,y},{z,w}in G_{triangle,square}$ are adjacent if and only if ${x,z},{x,w},{y,z},{y,w}in Vcup E$. The graph $G_{triangle,square}$ is called the $(triangle,square)$-edge graph of the graph $G$. In this paper, our ultimate goal is to provide a link between the ...
متن کاملCounting and Enumeration of Self-assembly Pathways for Symmetric Macromolecular Structures
We consider the problem of explicitly enumerating and counting the assembly pathways by which an icosahedral viral shell forms from identical constituent protein monomers. This poorly understood assembly process is a remarkable example of symmetric macromolecular self-assembly occuring in nature and possesses many features that are desirable while engineering self-assembly at the nanoscale. We ...
متن کاملCombinatorial Properties of One-Dimensional Arrangements
Arrangements are an omni-present topic in computational geometry, since many problems in computer graphics and robotics reduce to the study of such sets. Motivated by two problems from these areas —more precisely from ray-tracing and assembly planning, we study in this paper the combinatorial structure of arrangements of segments on a line and of cones on a circle. We show that the numbers of s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991